Balancing and Step Recovery Capturability via Sums-of-Squares Optimization

نویسندگان

  • Michael Posa
  • Twan Koolen
  • Russ Tedrake
چکیده

A fundamental requirement for legged robots is to maintain balance and prevent potentially damaging falls whenever possible. As a response to outside disturbances, fall prevention can be achieved by a combination of active balancing actions, e.g. through ankle torques and upper-body motion, and through reactive step placement. While it is widely accepted that stepping is required to respond to large disturbances, the limits of active motions on balancing and step recovery are only well understood for the simplest of walking models. Recent advances in convex optimization-based verification and control techniques enable a more complete understanding of the limits and capabilities of more complex models. In this work, we present an algorithmic approach for formal analysis of the viable-capture basins of walking robots, calculating both inner and outer approximations and corresponding push recovery control strategies. Extending beyond the classic Linear Inverted Pendulum Model (LIPM), we analyze a series of centroidal momentum based planar walking models, examining the effects of center of mass height, angular momentum, and impact dynamics during stepping on capturability. This formal analysis enables an explicit calculation of the differences between these models, and assessment of whether the simplest models ultimately sacrifice capability, and thus stability, when designing push recovery control policies.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Capturability-based Analysis of Legged Robot with Consideration of Swing Legs

Capturability of a robot determines whether it is able to capture a robot within a number of steps. Current capturability analysis is based on stance leg dynamics, without taking adequate consideration on swing leg. In this paper, we combine capturability-based analysis with swing leg dynamics. We first associate original definition of capturability with a timemargin, which encodes a time seque...

متن کامل

Capturability-based analysis and control of legged locomotion, Part 2: Application to M2V2, a lower-body humanoid

This two-part paper discusses the analysis and control of legged locomotion in terms of N -step capturability: the ability of a legged system to come to a stop without falling by taking N or fewer steps. We consider this ability to be crucial to legged locomotion and a useful, yet not overly restrictive criterion for stability. Part 1 introduced the N -step capturability framework and showed ho...

متن کامل

Exact Conic Programming Relaxations for a Class of Convex Polynomial Cone Programs

In this paper, under a suitable regularity condition, we establish that a broad class of conic convex polynomial optimization problems, called conic sum-of-squares convex polynomial programs, exhibits exact conic programming relaxation, which can be solved by various numerical methods such as interior point methods. By considering a general convex cone-program, we give unified results that appl...

متن کامل

Hydraulic Fracturing Length Optimization and its Impact on the Reservoir Performance

Hydraulic fracturing is one of the most common methods of well stimulation for reservoirs with low permeability. Hydraulic fracturing increases the flow capacity, alters flow geometry, bypasses damage and improves recovery factor. The pressure of most of Iranian oil reservoirs is declined and consequently the production is reduced. It is necessary to improve the production by using new stimulat...

متن کامل

Sparsity in sums of squares of polynomials

Representation of a given nonnegative multivariate polynomial in terms of a sum of squares of polynomials has become an essential subject in recent developments of sums of squares optimization and SDP (semidefinite programming) relaxation of polynomial optimization problems. We disscuss effective methods to obtain a simpler representation of a “sparse” polynomial as a sum of squares of sparse p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017